A String Primer*
نویسنده
چکیده
This is an elem&ary introduction to the classical and quantum mechanics of a single bosonic string, and to some aspects of its supersymmetric and heterotic extensions1
منابع مشابه
A Formal Language Model of DNA Polymerase Enzymatic Activity
We propose and investigate a formal language operation inspired by the naturally occurring phenomenon of DNA primer extension by a DNAtemplate-directed DNA Polymerase enzyme. Given two DNA strings u and v, where the shorter string v (called primer) is Watson-Crick complementary and can thus bind to a substring of the longer string u (called template) the result of the primer extension is a DNA ...
متن کاملA Closer Look at the Closest String and Closest Substring Problem
Let S be a set of k strings over an alphabet Σ; each string has a length between ` and n. The Closest Substring Problem (CSSP) is to find a minimal integer d (and a corresponding string t of length `) such that each string s ∈ S has a substring of length ` with Hamming distance at most d to t. We say t is the closest substring to S. For ` = n, this problem is known as the Closest String Problem...
متن کاملA Fast Algorithm for the Inexact Characteristic String Problem
We present a new algorithm to solve the INEXACT CHARACTERISTIC STRING PROBLEM using Hamming distance instead of Levenshtein distance as a measure. We embed our new algorithm and the previously known algorithm for Levenshtein distance in a common framework which reveals an additional improvement to the Levenshtein distance algorithm. The INEXACT CHARACTERISTIC STRING PROBLEM can thus be solved i...
متن کاملThe entropy of black holes: a primer
After recalling the definition of black holes, and reviewing their energetics and their classical thermodynamics, one expounds the conjecture of Bekenstein, attributing an entropy to black holes, and the calculation by Hawking of the semi-classical radiation spectrum of a black hole, involving a thermal (Planckian) factor. One then discusses the attempts to interpret the black-hole entropy as t...
متن کاملMore Efficient Algorithms for Closest String and Substring Problems
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been extensively studied recently in computational biology. Unfortunately both problems are NP-complete. Researchers have developed both fixed-parameter algorithms and approximation algorithms for the two pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986